Direct Mining of Closed Tree Patterns With Subtree Constraint
نویسندگان
چکیده
Two critical bottle necks in mining frequent tree patterns from tree databases are the exponential number of mined patterns and the lack of user focus on the mining process. We propose, in this paper, an algorithm that solves the problems for unordered attribute trees by mining only the compact representation of tree patterns, i.e. closed tree patterns, and allows users to mine only trees of their interest by specifying subtree constraints. The experimental results show the efficiency of our algorithm.
منابع مشابه
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called PrefixTreeESpan (i.e. Prefix-Treeprojected Embedded-Subtree pattern), which finds a subtree pattern by growing a frequent prefix-tree. Thus, using divide and conquer, mining local length-1 frequent subtree patterns in P...
متن کاملPCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informatics, XML processing, computational linguistics, and web usage mining. Despite the advances in frequent subtree mining, mining for the entire frequent subtrees is infeasible due to the combinatorial explosion of the freq...
متن کاملMethod for Extracting Valuable Common Structures from Heterogeneous Rooted and Labeled Tree Data
The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns. Because mining frequent tree patterns has a wide range of applications such as XML mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms su...
متن کاملCMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees is to find frequently occurring subtrees. However, because of the combinatorial explosion, the number of frequent subtrees usually grows exponentially with the size of the subtrees. In this paper, we p...
متن کاملEvoMiner: Frequent Subtree Mining in Phylogenetic Databases Technical Report #11-08, Dept. of Computer Science, Iowa State University
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to make sense of the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic trees. EvoMiner is an Apriori-like le...
متن کامل